Asymptotically optimal algorithm

Results: 45



#Item
31Efficient Regret Bounds for Online Bid Optimisation in Budget-Limited Sponsored Search Auctions Long Tran-Thanh1 , Lampros Stavrogiannis1 , Victor Naroditskiy1 Valentin Robu1 , Nicholas R Jennings1 and Peter Key2 1: Univ

Efficient Regret Bounds for Online Bid Optimisation in Budget-Limited Sponsored Search Auctions Long Tran-Thanh1 , Lampros Stavrogiannis1 , Victor Naroditskiy1 Valentin Robu1 , Nicholas R Jennings1 and Peter Key2 1: Univ

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2014-06-20 12:31:45
32Adaptive Algorithms for Problems Involving Black-Box Lipschitz Functions by Ilya Baran B.S., Massachusetts Institute of Technology (2003)

Adaptive Algorithms for Problems Involving Black-Box Lipschitz Functions by Ilya Baran B.S., Massachusetts Institute of Technology (2003)

Add to Reading List

Source URL: erikdemaine.org

Language: English - Date: 2006-02-03 21:38:13
33Cache-Oblivious Algorithms E XTENDED A BSTRACT Matteo Frigo Charles E. Leiserson Harald Prokop Sridhar Ramachandran

Cache-Oblivious Algorithms E XTENDED A BSTRACT Matteo Frigo Charles E. Leiserson Harald Prokop Sridhar Ramachandran

Add to Reading List

Source URL: supertech.csail.mit.edu

Language: English - Date: 2014-09-16 08:27:48
34Latent Bandits. Odalric-Ambrym Maillard ODALRIC - AMBRYM . MAILLARD @ ENS - CACHAN . ORG The Technion, Faculty of Electrical Engineering[removed]Haifa, ISRAEL Shie Mannor The Technion, Faculty of Electrical Engineering 320

Latent Bandits. Odalric-Ambrym Maillard ODALRIC - AMBRYM . MAILLARD @ ENS - CACHAN . ORG The Technion, Faculty of Electrical Engineering[removed]Haifa, ISRAEL Shie Mannor The Technion, Faculty of Electrical Engineering 320

Add to Reading List

Source URL: jmlr.org

Language: English - Date: 2014-02-16 19:30:21
35Asymptotically-optimal Path Planning for Manipulation using Incremental Sampling-based Algorithms Alejandro Perez Sertac Karaman Alexander Shkolnik Emilio Frazzoli Seth Teller Matthew R. Walter Abstract— A desirable pr

Asymptotically-optimal Path Planning for Manipulation using Incremental Sampling-based Algorithms Alejandro Perez Sertac Karaman Alexander Shkolnik Emilio Frazzoli Seth Teller Matthew R. Walter Abstract— A desirable pr

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2011-10-05 15:18:02
361  Trajectory Codes for Flash Memory Anxiao (Andrew) Jiang, Member, IEEE, Michael Langberg, Member, IEEE, Moshe Schwartz, Senior Member, IEEE, and Jehoshua Bruck, Fellow, IEEE

1 Trajectory Codes for Flash Memory Anxiao (Andrew) Jiang, Member, IEEE, Michael Langberg, Member, IEEE, Moshe Schwartz, Senior Member, IEEE, and Jehoshua Bruck, Fellow, IEEE

Add to Reading List

Source URL: www.paradise.caltech.edu

Language: English - Date: 2010-12-24 18:24:50
37A Fast Algorithm for Approximate Quantiles in High Speed Data Streams

A Fast Algorithm for Approximate Quantiles in High Speed Data Streams

Add to Reading List

Source URL: www.cs.ucla.edu

Language: English - Date: 2007-11-08 11:58:27
38Asymptotically-optimal Path Planning for Manipulation using Incremental Sampling-based Algorithms

Asymptotically-optimal Path Planning for Manipulation using Incremental Sampling-based Algorithms

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2011-07-19 11:27:51
39A Communication-Optimal N-Body Algorithm for Direct Interactions Michael Driscoll∗ 1 , Evangelos Georganas∗ 1 , Penporn Koanantakool∗ 1 , Edgar Solomonik∗ , and Katherine Yelick∗† ∗ Computer Science Divisio

A Communication-Optimal N-Body Algorithm for Direct Interactions Michael Driscoll∗ 1 , Evangelos Georganas∗ 1 , Penporn Koanantakool∗ 1 , Edgar Solomonik∗ , and Katherine Yelick∗† ∗ Computer Science Divisio

Add to Reading List

Source URL: www.eecs.berkeley.edu

Language: English - Date: 2013-02-08 21:20:36